Discrete Morse theory and extendedL2 homology

نویسندگان

  • Varghese Mathai
  • Stuart G. Yates
چکیده

A brief overviewof Forman’s discrete Morse theory is presented, from which analogues of the main results of classical Morse theory can be derived for discrete Morse functions, these being functions mapping the set of cells of a CW complex to the real numbers satisfying some combinatorial relations. The discrete analogue of the strong Morse inequality was proved by Forman for finite CW complexes using a Witten deformation technique. This deformation argument is adapted to provide strong Morse inequalities for infinite CW complexes which have a finite cellular domain under the free cellular action of a discrete group. The inequalities derived are analogous of the L2 Morse inequalities of Novikov and Shubin ([14]), and the asymptoticL2 Morse inequalities of an inexact Morse 1-form as derived in [13]. We also obtain quantitative lower bounds for the Morse numbers whenever the spectrum of the Laplacian contains zero, using the extended category of Farber [5] (see also [12]).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Persistent Homology via Discrete Morse Theory

This report provides theoretical justification for the use of discrete Morse theory for the computation of homology and persistent homology, an overview of the state of the art for the computation of discrete Morse matchings and motivation for an interest in these computations, particularly from the point of view of topological data analysis. Additionally, a new simulated annealing based method...

متن کامل

Computing homology and persistent homology using iterated Morse decomposition

In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph theoretical operations. We use iterated Morse decomposition, which allows us to sidetrack many problems related to the standard discrete Morse theory. In particu...

متن کامل

The Efficiency of a Homology Algorithm based on Discrete Morse Theory and Coreductions

Two implementations of a homology algorithm based on the Forman’s discrete Morse theory combined with the coreduction method are presented. Their efficiency is compared with other implementations of homology algorithms.

متن کامل

Towards Optimality in Discrete Morse Theory through Chain Homotopies

Once a discrete Morse function has been defined on a finite cell complex, information about its homology can be deduced from its critical elements. The main objective of this paper is to define optimal discrete gradient vector fields on general finite cell complexes, where optimality entails having the least number of critical elements. Our approach is to consider this problem as a homology com...

متن کامل

Discrete Morse Theoretic Algorithms for Computing Homology of Complexes and Maps

We provide explicit and efficient reduction algorithms based on discrete Morse theory to simplify homology computation for a very general class of complexes. A set-valued map of top-dimensional cells between such complexes is a natural discrete approximation of an underlying (and possibly unknown) continuous function, especially when the evaluation of that function is subject to measurement err...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007